Extending Description Logics with Uncertainty Reasoning in Possibilistic Logic
نویسندگان
چکیده
Possibilistic logic provides a convenient tool for dealing with inconsistency and handling uncertainty. In this paper, we propose possibilistic description logics as an extension of description logics. We give semantics and syntax of possibilistic description logics. We then define two inference services in possibilistic description logics. Since possibilistic inference suffers from the drowning problem, we consider a drowning-free variant of possibilistic inference, called linear order inference. Finally, we implement the algorithms for inference services in possibilistic description logics using KAON2 reasoner.
منابع مشابه
PossDL - A Possibilistic DL Reasoner for Uncertainty Reasoning and Inconsistency Handling
Uncertainty reasoning and inconsistency handling are two important problems that often occur in the applications of the Semantic Web. Possibilistic description logics provide a flexible framework for representing and reasoning with ontologies where uncertain and/or inconsistent information exists. Based on our previous work, we develop a possibilistic description logic reasoner. Our demo will i...
متن کاملPossibilistic Planning Using Description Logics: A First Step
This paper is a first step in the direction of extending possibilistic planning to take advantage of the expressive power and reasoning capabilities of fuzzy description logics. Fuzzy description logics are used to describe knowledge about the world and about actions. Fundamental definitions are given and the possibilistic planning problem is recast in this new setting.
متن کاملA Possibilistic Extension of Description Logics
Possibilistic logic provides a convenient tool for dealing with inconsistency and handling uncertainty. In this paper, we propose possibilistic description logics (DLs) as an extension of description logics. We give semantics and syntax of possibilistic description logics. Two kinds of inference services are considered in our logics and algorithms are provided for them. These algorithms are imp...
متن کاملExtending uncertainty formalisms to linear constraints and other complex formalisms
Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying AI uncertainty formalisms to this situation, as their representation of the underlying logic, either as a mutually exclusive and exhaustive set of possibilities, or with a propositional or a predicate logic, is inappropriate (or at least unh...
متن کاملPossibilistic Residuated Implication Logics and Applications
In this paper, we will develop a class of logics for reasoning about qualitative and quantitative uncertainty. The semantics of the logics is uniformly based on possibility theory. Each logic in the class is parameterized by a t-norm operation on 0,1], and we express the degree of implication between the possibilities of two formulas explicitly by using residuated implication with respect to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Intell. Syst.
دوره 26 شماره
صفحات -
تاریخ انتشار 2007